Structured conditioning of matrix functions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ela Structured Conditioning of Matrix Functions

STRUCTURED CONDITIONING OF MATRIX FUNCTIONS∗ PHILIP I. DAVIES† Abstract. The existing theory of conditioning for matrix functions f(X):Cn×n → Cn×n does not cater for structure in the matrix X. An extension of this theory is presented in which when X has structure, all perturbations of X are required to have the same structure. Two classes of structured matrices are considered, those comprising ...

متن کامل

Lommel Matrix Functions

The main objective of this work is to develop a pair of Lommel matrix functions suggested by the hypergeometric matrix functions and some of their properties are studied. Some properties of the hypergeometric and Bessel matrix functions are obtained.

متن کامل

Geometric conditioning of belief functions

In this paper we study the problem of conditioning a belief function b with respect to an event A by geometrically projecting such belief function onto the simplex associated with A in the simplex of all belief functions. Two different such simplices can be defined, as each belief function can be represented as the vector of its basic probability values or the vector of its belief values. We sh...

متن کامل

Matrix Intersection Problems for Conditioning

Conditioning of a nonsingular matrix subspace is addressed in terms of its best conditioned elements. Computationally the problem is seemingly challenging. By associating with the task an intersection problem with unitary matrices leads to a more accessible approach. A resulting matrix nearness problem can be viewed to generalize the so-called Löwdin problem in quantum chemistry. For critical p...

متن کامل

Matrix Probing and its Conditioning

When a matrix A with n columns is known to be well-approximated by a linear combination of basis matrices B1, . . . , Bp, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can be used to obtain an approximation to A−1. A basic question is whether this linear system is well-conditioned. This is important for two reasons: a well-con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Linear Algebra

سال: 2004

ISSN: 1081-3810

DOI: 10.13001/1081-3810.1128